Explanation-based learning and finite state transducers: applications to parsing lexicalized tree adjoining grammars
نویسنده
چکیده
Explanation-based Learning techniques have been applied in NLP for speeding up parsing in limited domains. In 7], we showed that combining the LTAG representation with the EBL technique provides a novel method for parsing based on a FST mechanism and demonstrated a speedup in parsing times on the ATIS corpus. In this paper, we extend that approach to account for cases of \long distance extrac-tions" and show that the same FST mechanism can be used for these sentences as well.
منابع مشابه
Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars
In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over recursive structures and (c) representation of generalized parses as Finite State Transducers. A highly impoverished parser called a \stapler" has a...
متن کاملSome Novel Applications of Explanation � Based Learning to Parsing Lexicalized Tree �
In this paper we present some novel ap plications of Explanation Based Learning EBL technique to parsing Lexicalized Tree Adjoining grammars The novel as pects are a immediate generalization of parses in the training set b generaliza tion over recursive structures and c rep resentation of generalized parses as Finite State Transducers A highly impoverished parser called a stapler has also been ...
متن کاملSome Novel Applications of Explanation-Based Learning for Parsing Lexicalized Tree-Adjoining Grammars
In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over recursive structures and (c) representation of generalized parses as Finite State Transducers. A highly impoverished parser called a "stapler" has a...
متن کاملSome Experiments on Indicators of Parsing Complexity for Lexicalized Grammars
In this paper, we identify syntactic lexical ambiguity and sentence complexity as factors that contribute to parsing complexity in fully lexicalized grammar formalisms such as Lexicalized Tree Adjoining Grammars. We also report on experiments that explore the effects of these factors on parsing complexity. We discuss how these constraints can be exploited in improving efficiency of parsers for ...
متن کاملThings between Lexicon and Grammar
A number of grammar formalisms were proposed in 80’s, such as Lexical Functional Grammars, Generalized Phrase Structure Grammars, and Tree Adjoining Grammars. Those formalisms then started to put a stress on lexicon, and were called as lexicalist (or lexicalized) grammars. Representative examples of lexicalist grammars were Head-driven Phrase Structure Grammars (HPSG) and Lexicalized Tree Adjoi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Natural Language Engineering
دوره 2 شماره
صفحات -
تاریخ انتشار 1996